Recursive equivalence types on recursive manifolds.
نویسندگان
چکیده
منابع مشابه
Recursive Equivalence
1. Introductory remarks Classical set theory and the theory of computable (recursive) functions are the basic areas between which the theory of recursive equivalence forms a bridge. Recursive functions of k arguments are those functions from the k = n cartesian product xN = Nx ...xN (k times) of the natural numbers N = {0,1,2,...} into N which are defined on the whole of JV and whose values can...
متن کاملRecursive Types
Vladimir Gapeyev Michael Y. Levin Benjamin C. Pierce Department of Computer and Information Science University of Pennsylvania fvgapeyev,bcpierce,[email protected] Category: Pearls Abstract Algorithms for checking subtyping between recursive types lie at the core of many modern programming language implementations. But the fundamental theory of these algorithms and how they relate to simpl...
متن کاملSyntactic Considerations on Recursive Types
We study recursive types from a syntactic perspective. In particular, we compare the formulations of recurs-ive types that are used in programming languages and formal systems. Our main tool is a new syntactic explanation of type expressions as functors. We also introduce a simple logic for programs with recursive types in which we carry out our proofs.
متن کاملGames for Recursive Types
We present results concerning the solution of recursive domain equations in the category G of games, which is a modiied version of the category presented in AJM94]. New constructions corresponding to lifting and separated sum for games are presented, and are used to generate games for two simple recursive types: the vertical and lazy natural numbers. Recently, the \game semantics" paradigm has ...
متن کاملRecursive Session Types Revisited
Session types model structured communication-based programming. In particular, binary session types for the πcalculus describe communication between exactly two participants in a distributed scenario. Adding sessions to the πcalculus means augmenting it with type and term constructs. In a previous paper, we tried to understand to which extent the session constructs are more complex and expressi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1979
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093882398